一种改进的特征匹配算法在碎片云测量建模中的应用

为满足超高速撞击典型Whipple防护构型的损伤评估需求,利用图像处理技术对碎片云序列阴影图像进行深入研究。使用超高速序列激光阴影成像仪得到三组不同实验条件下碎片云发展过程的高清阴影图像,分别对每组最具代表性的2帧进行图像处理分析;根据碎片云图像特点以及碎片运动特性,提出了一种改进的碎片二次特征匹配算法,该方法包含碎片粗定位、特征定义及初匹配和精确匹配三步策略;通过运用改进的匹配算法,对选取的相邻两帧图片完成碎片高效匹配,并提取匹配碎片的运动参数,进而分析碎片的速度分布和飞行角度分布,获取二次碎片云相关运动特性;得到三组实验各自的轨迹模拟图。根据得到的轨迹分析结果分别对三组实验的后板损伤进行估计,并通过与防护构型的实际损伤结果进行比较,验证了该方法的有效性。     

A Tradeoff Between Accuracy and Speed for K-Means Seed Determination

With a sharp increase in the information volume, analyzing and retrieving this vast data volume is much more essential than ever. One of the main techniques that would be beneficial in this regard is called the Clustering method. Clustering aims to classify objects so that all objects within a cluster have similar features while other objects in different clusters are as distinct as possible. One of the most widely used clustering algorithms with the well and approved performance in different applications is the k-means algorithm. The main problem of the k-means algorithm is its performance which can be directly affected by the selection in the primary clusters. Lack of attention to this crucial issue has consequences such as creating empty clusters and decreasing the convergence time. Besides, the selection of appropriate initial seeds can reduce the cluster’s inconsistency. In this paper, we present a new method to determine the initial seeds of the k-mean algorithm to improve the accuracy and decrease the number of iterations of the algorithm. For this purpose, a new method is proposed considering the average distance between objects to determine the initial seeds. Our method attempts to provide a proper tradeoff between the accuracy and speed of the clustering algorithm. The experimental results showed that our proposed approach outperforms the Chithra with 1.7% and 2.1% in terms of clustering accuracy for Wine and Abalone detection data, respectively. Furthermore, achieved results indicate that comparing with the Reverse Nearest Neighbor (RNN) search approach, the proposed method has a higher convergence speed.     

基于拼接缝自适应消除和全景图矫直的快速图像拼接算法

针对图像拼接存在色差过渡不均匀、图像倾斜扭曲及拼接效率低的现象，提出一种基于拼接缝自适应消除和全景图矫直的快速图像拼接算法。首先，用尺度不变特征变换（SIFT）提取图像指定区域特征点并用双向K近邻（KNN）算法进行图像配准，有效提高算法效率；其次，利用动态规划思想提出自适应公式找到最优拼接缝并用图像融合算法对其自适应消除，解决拼接缝色差过渡不均匀问题；最后，针对累积拼接误差形成全景图倾斜的现象，利用边缘检测算法提出自适应拟合四边形矫直模型，把原始全景图矫直为一个全新的全景图。所提算法与分块图像拼接和二叉树图像拼接算法相比，图像质量提升了5.84%~7.83%，拼接时间仅为原来的50%~70%。实验结果表明，该算法不仅通过自适应更新机制减少不同图像背景下拼接缝色差过渡不均匀的现象，从而提高了图像质量；而且提高了拼接效率，降低了全景图倾斜扭曲程度。     

基于K-AP算法的高光谱图像波段选择方法

在高光谱图像分析领域中，波段选择是一种能有效减少高光谱图像维度的方法。K类仿射传播算法是一种高效的聚类算法，已成功地应用于人脸识别和数据分析等领域，但在高光谱图像分析领域还少有成功的应用。提出将K-AP算法应用于高光谱图像波段选择，对高光谱图像进行有效的数据压缩。针对K-AP算法的特点，基于Kullback-Leibler散度定义了新的相似度矩阵，对波段进行度量，再使用K-AP算法进行聚类，选择最有代表性的波段。实验结果表明，与常用的波段选择方法相比，所提出的方法有更好的表现。     

变分自编码器模型综述

变分自编码器（VAE）作为深度隐空间生成模型的一种，近年来其表现性能取得了极大的成功，尤其是在图像生成方面。变分自编码器模型作为无监督式特征学习的重要工具之一，可以通过学习隐编码空间与数据生成空间的特征映射，进而在输出端重构生成输入数据。梳理了传统变分自编码器模型及其衍生变体模型的发展与研究现状，并就此做了总结和对比，最后分析了变分自编码器模型存在的问题与挑战，并就可能的发展趋势做了展望。     

结合位图切割和区域合并的彩色图像分割

就经典分水岭图像分割算法中存在的过分割问题，提出一种结合位图切割和区域合并的彩色图像分割算法。对原始彩色图像通过空域梯度算子求其梯度图像，并利用位图切割重建梯度图像；对新梯度图像进行分水岭预分割；对预分割图像基于异质性最小原则进行区域合并，并获得最终分割结果。相比于现有的同类方法，该算法引入位图切割，抑制噪声对分割结果的影响，在边缘模糊处分割准确，得到符合人类视觉的较小分割区域数目，同时在运行效率上提高。     

Digital image correlation for strain measurement in plastic film blowing process

Surface deformation study of a polymer film during plastic film blowing (PFB) extrusion process though is considered essential, is difficult to execute as the process is fast and continuous. Digital image correlation (DIC) is an optical technique that is non-destructive, highly accurate and designed to measure deformations from micro to macro scale. DIC can be proposed as a reliable tool to understand the relationship of polymer structure-processing-properties. In this literature, digital image correlation, its basic principle of operation and reliability guided DIC for continuous large deformation are comprehensively explored. Versatility of DIC, and the conditions that affect the measurement algorithm as well as preceding use of DIC in polymer processes are reviewed. The implementation and potential use of DIC in PFB are described.

This review was submitted as part of the 2019 Materials Literature Review Prize of the Institute of Materials, Minerals and Mining run by the Editorial Board of MST. Sponsorship of the prize by TWI Ltd is gratefully acknowledged.     

On the application of remote sensing towards the estimation of cultivated land lost to urbanization

In this research work, a 40-km² SPOT-5 High-Resolution Imagery (HRI) of the Warsak locality in district Peshawar, Pakistan, was utilized to approximate the quantity of cultivated land lost to urbanization, due to the construction of new homes and buildings. The imagery from a period of 2005 to 2015 for wheat crop was taken, specifically during the months of March and June when the crop is rich green and golden ripe respectively. eCognition ® program’s Object-Oriented Classification Method (OOCM) was employed for recognition of land versus buildings. Nearest Neighbour (NN), Support Vector Machine (SVM), Decision Trees (DT) and Random Forests (RF) were utilized for the classification process. The results demonstrated that the urbanized area had increased by approximately 28 per cent in the area considered. Moreover, the efficacy of the proposed method is depicted by an accuracy of 97.9 per cent and a Kappa Statistics of 0.975 for the SVM classifier.     

基于小波变换的分数阶微分算法在肝脏肿瘤CT图像纹理增强中的应用

图像纹理增强过程中容易丢失平滑区域纹理细节，而分数阶微分增强虽然能够非线性保留平滑区域纹理细节，但对频率分辨率敏感。针对这个问题，提出一种基于小波变换的分数阶微分纹理增强算法，应用于平扫计算机断层扫描（CT）图像的肝脏肿瘤区域的纹理增强。首先，通过小波变换将图像感兴趣区分解成多个子带分量；其次，基于分数阶微分定义构造一个带补偿参数的分数阶微分掩膜；最后，使用该掩膜与每个高频子带分量进行卷积并利用小波逆变换重组图像感兴趣区。实验结果表明，该方法在使用较大分数阶次显著增强肿瘤区域的高频轮廓信息的同时，有效地保留了低频平滑的纹理细节：增强后的肝细胞癌区域与原区域相比，信息熵平均增加36.56%，平均梯度平均增加321.56%，平均绝对差值平均为9.287；增强后的肝血管瘤区域与原区域相比，信息熵平均增加48.77%，平均梯度平均增加511.26%，平均绝对差值平均为14.097。